// Problem: 
// Contest: 
// URL: 
// Memory Limit: 
// Time Limit: 
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
bool cmp(int x,int y)
{
	return x>y;
}
signed main()
{
	int t=1;
	cin>>t;
	while(t--)
	{
		int n,x;
		cin>>n>>x;
		vector<int> v(n+1);
		for(int i=1;i<=n;i++)
		{
			cin>>v[i];
		}
		sort(v.begin()+1,v.end(),cmp);
		int ans=0;
		for(int i=1;i<=n;i++)
		{
			if(v[i]>=x)ans++;
			else
			{
				bool f=0;
				for(int j=i+1;j<=n;j++)
				{
					if((j-i+1)*v[j]>=x)
					{
						ans++;
						i=j;
						f=1;
						break;
					}
				}
				if(!f)break;
			}
		}
		cout<<ans<<endl;
	}
	return 0;
}
